منابع مشابه
completions on partial matrices ?
An n × n matrix is called an N0-matrix if all its principal minors are nonpositive. In this paper, we are interested in N0-matrix completion problems, that is, when a partial N0-matrix has an N0-matrix completion. In general, a combinatorially or non-combinatorially symmetric partial N0-matrix does not have an N0-matrix completion. Here, we prove that a combinatorially symmetric partial N0-matr...
متن کاملconstructing gender identity through narratives based on hallidays metafunctions
هویت, شکل دادن و بازنمایی آن در گفتمان, توجه بسیاری از محققان این رشته را به خود جلب کرده است. تحقیق حاضر بر شکل دادن به هویت جنسیتی هشت تن از دانشجویان ایرانی مشغول به تحصیل در دوره کارشناسی ارشد از طریق بررسی روایات آنان از تجربیات شخصی, متمرکز شده است. تحلیل داده ها در این تحقیق مشتمل بر سه بخش است: بخش اول شامل کدگذاری موضوعی روایات است که بر اساس آن هویت جنسیتی شرکت کنندگان در تحقیق بر اسا...
15 صفحه اولRelative Completions
We compute the completion of the groups SLn(Zt]) and SLn (Zt;t ?1 ]) relative to the obvious homomorphisms to SLn (Q); this is a generalization of the classical Malcev completion. We also make partial computations of the rational second cohomology of these groups.
متن کاملOn-Line Scheduling to Maximize Task Completions
In overloaded task systems, it is by de nition not possible to complete all tasks by their deadlines. However it may still be desirable to maximize the number of in-time task completions. The performance of on-line schedulers with respect to this metric is investigated here. It is shown that in general, an on-line algorithm may perform arbitrarily poorly as compared to clairvoyant (o -line) sch...
متن کاملTotally nonpositive completions on partial matrices ∗ †
An n × n real matrix is said to be totally nonpositive if every minor is nonpositive. In this paper, we are interested in totally nonpositive completion problems, that is, does a partial totally nonpositive matrix have a totally nonpositive matrix completion? This problem has, in general, a negative answer. Therefore, we analyze the question: for which labeled graphs G does every partial totall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2005
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1122038923